Generating fixed-length sequences satisfying any given nth-order transition probability matrix.
نویسندگان
چکیده
An experimental design involving sequences of m distinct events can be conceptualized as an nth-order transition probability matrix specifying the probabilities with which each of the m distinct events is to follow certain n-grams. This paper describes a general method for constructing sequences of shortest possible length that satisfy any such matrix and presents a computer program that randomly generates such sequences.
منابع مشابه
Evaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملA program for generating randomized simple and context-sensitive sequences.
This article introduces Sequence Generation 2008 (SeqGen2008), a Windows-based sequence generator. SeqGen2008 can generate simple sequences satisfying user-defined event probabilities or frequencies. The program can also generate context-sensitive sequences satisfying user-defined transition matrices that specify the probabilities or frequencies with which distinct events are to follow specific...
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملCapacity Achieving Linear Codes with Random Binary Sparse Generating Matrices
In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover, the codes with sparse generating matrices reported in the lite...
متن کاملDesign of Logic Network for Generating Sequency Ordered Hadamard Matrix H
A logic network to produce the sequency ordered Hadamard matrix H based on the property of gray code and orthogonal group codes is developed. The network uses a counter to generate Rademacher function such that the output of H will be in sequency. A general purpose shift register with output logic is used to establish a sequence of period P corresponding to a given value of order m of the Hadam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Behavior research methods, instruments, & computers : a journal of the Psychonomic Society, Inc
دوره 31 2 شماره
صفحات -
تاریخ انتشار 1999